A Refined Exact Algorithm for Edge Dominating Set
نویسندگان
چکیده
We present an O∗(1.3160n)-time algorithm for the edge dominating set problem in an n-vertex graph, which improves previous exact algorithms for this problem. The algorithm is analyzed by using the “Measure and Conquer method.” We design new branching rules based on conceptually simple local structures, called “clique-producing vertices/cycles,” which significantly simplify the algorithm and its running time analysis, attaining an improved time bound at the same time.
منابع مشابه
An O *(1.1939 n ) Time Algorithm for Minimum Weighted Dominating Induced Matching
Say that an edge of a graph G dominates itself and every other edge adjacent to it. An edge dominating set of a graph G = (V,E) is a subset of edges E′ ⊆ E which dominates all edges of G. In particular, if every edge of G is dominated by exactly one edge of E′ then E′ is a dominating induced matching. It is known that not every graph admits a dominating induced matching, while the problem to de...
متن کاملEfficient Enumeration-Based Exact Algorithms
We analyze edge dominating set from a parameterized perspective. More specifically, we prove that this problem is in FPT for general (weighted) graphs. The corresponding algorithms rely on enumeration techniques. In particular, we show how the use of compact representations may speed up the decision algorithm.
متن کاملExact Algorithms for Annotated Edge Dominating Set in Cubic Graphs
Given a graph G = (V,E) together with a nonnegative integer requirement on vertices r : V → Z+, the annotated edge dominating set problem is to find a minimum set M ⊆ E such that, each edge in E −M is adjacent to some edge in M , and M contains at least r(v) edges incident on each vertex v ∈ V . The annotated edge dominating set problem is a natural extension of the classical edge dominating se...
متن کاملExact Algorithms for Dominating Induced Matching Based on Graph Partition
A dominating induced matching, also called an efficient edge domination, of a graph G = (V,E) with n = |V | vertices andm = |E| edges is a subset F ⊆ E of edges in the graph such that no two edges in F share a common endpoint and each edge in E\F is incident with exactly one edge in F . It is NP-hard to decide whether a graph admits a dominating induced matching or not. In this paper, we design...
متن کاملExact algorithms for dominating induced matchings
Say that an edge of a graph G dominates itself and every other edge adjacent to it. An edge dominating set of a graph G = (V,E) is a subset of edges E′ ⊆ E which dominates all edges of G. In particular, if every edge of G is dominated by exactly one edge of E′ then E′ is a dominating induced matching. It is known that not every graph admits a dominating induced matching, while the problem to de...
متن کامل